Graph-like combinatorial structures in (r, 1)-designs
نویسندگان
چکیده
منابع مشابه
Theta Graph Designs
We solve the design spectrum problem for all theta graphs with 10, 11, 12, 13, 14 and 15 edges.
متن کاملCombinatorial designs related to the strong perfect graph conjecture
Our graphs are “Michigan” except that they have vertices and edges rather than points and lines. If G is a graph, then y1 = y1 (G) denotes the number of its vertices, ar = (Y(G) denotes the size of its largest stable (independent) set of vertices and o = o(G) denotes the size of its largest clique. The graphs that we are interested in have the following three properties: (i) n =0X0+1, (ii) ever...
متن کاملMerging graph - like object structures Albert
1 INTRODUCTION This paper addresses the problem of coordinating a team of software developers concurrently working on a common software system. The standard approach to coordinate concurrent activities on a common set of data is locking. Any part of data used by one person is locked against concurrent use by another person. The second person has to wait until the first person has finished his o...
متن کاملRainbow perfect matchings in r-partite graph structures
A latin transversal in a square matrix of order n is a set of entries, no two in the same row or column, which are pairwise distinct. A longstanding conjecture of Ryser states that every Latin square with odd order has a latin transversal. Some results on the existence of a large partial latin transversal can be found in [11,6,16]. Mainly motivated by Ryser’s conjecture, Erdős and Spencer [8] p...
متن کاملMosaics of combinatorial designs
Abstract. Looking at incidence matrices of t (v, k, λ) designs as v×b matrices with 2 possible entries, each of which indicates incidences of a t -design, we introduce the notion of a c -mosaic of designs, having the same number of points and blocks, as a matrix with c different entries, such that each entry defines incidences of a design. In fact, a v×b matrix is decomposed in c incidence matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1994
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0061-8